Low rank approximations of infinite-dimensional Lyapunov equations and applications

نویسندگان

  • Luka Grubǐsić
  • Daniel Kressner
چکیده

Lyapunov equation. We analyze the approximation properties of solutions of abstract Lyapunov equations in the setting of a scale of Hilbert spaces associated to an unbounded diagonalizable operator which satisfies the Kato’s square root theorem. We call an (unbounded) operator A diagonalizable if there exists a bounded operator Q, with a bounded inverse, such that the (unbounded) operator Q−1AQ is a normal operator with a compact resolvent. We assume that A generates an exponentially stable analytic semigroup and we construct—using sinc-quadrature techniques—a rank (2k + 1) × Ran(B) approximation X2k to the operator X. We also give conditions under which an estimate √√√√ ∞ ∑ i=2k+2 σ2 i (X) ≤ ‖X −X2k‖HS ≤ O(exp −π √ ) , (1) holds. Here ‖X‖HS = √ tr(X∗X) denotes the Hilbert-Schmidt norm of X and we note that our technique allows us to give the constant in the O(·) notation explicitly in terms of the weighted norms of A, B and Q and an estimate on the spectrum of A. In the case of a (more strongly) unbounded control operator B, e.g. an operator only bounded in a weighted Hilbert space, we obtain the same type of convergence estimates in an associated weighted norm on (the subspace of) the space of compact operators. Based on our convergence estimates we also discuss ramifications of this analysis for the design of adaptive finite element methods including the analysis of the influence of linear algebra approximations on the overall process. In this talk we will also discuss possible interpretations of the solutions of Lyapunov equations in the (negative order) Sobolev spaces of mixed derivatives and relate weighted operator norms of the solution of Lyapunov equation with the total energy of the system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-rank Iterative Methods for Projected Generalized Lyapunov Equations

LOW-RANK ITERATIVE METHODS FOR PROJECTED GENERALIZED LYAPUNOV EQUATIONS TATJANA STYKEL Abstract. We generalize an alternating direction implicit method and the Smith method for large-scale projected generalized Lyapunov equations. Such equations arise in model reduction of descriptor systems. Low-rank versions of these methods are also presented, which can be used to compute low-rank approximat...

متن کامل

Low-rank iterative methods of periodic projected Lyapunov equations and their application in model reduction of periodic descriptor systems

Low-rank iterative methods of periodic projected Lyapunov equations and their application in model reduction of periodic descriptor systems Low-rank iterative methods of periodic projected Lyapunov equations and their application in model reduction of periodic descriptor systems Abstract We discuss the numerical solution of large-scale sparse projected discrete-time periodic Lyapunov equations ...

متن کامل

On the ADI method for the Sylvester Equation and the optimal-$\mathcal{H}_2$ points

The ADI iteration is closely related to the rational Krylov projection methods for constructing low rank approximations to the solution of Sylvester equation. In this paper we show that the ADI and rational Krylov approximations are in fact equivalent when a special choice of shifts are employed in both methods. We will call these shifts pseudo H2-optimal shifts. These shifts are also optimal i...

متن کامل

On the ADI method for the Sylvester Equation and the optimal-H2 points

The ADI iteration is closely related to the rational Krylov projection methods for constructing low rank approximations to the solution of Sylvester equation. In this paper we show that the ADI and rational Krylov approximations are in fact equivalent when a special choice of shifts are employed in both methods. We will call these shifts pseudo H2-optimal shifts. These shifts are also optimal i...

متن کامل

Least-Squares Approximate Solution of Overdetermined Sylvester Equations

We address the problem of computing a low-rank estimate Y of the solution X of the Lyapunov equation AX + XA′ + Q = 0 without computing the matrix X itself. This problem has applications in both the reduced-order modeling and the control of large dimensional systems as well as in a hybrid algorithm for the rapid numerical solution of the Lyapunov equation via the alternating direction implicit ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014